Sorted HiLog: Sorts in Higher-Order Logic Data Languages
نویسندگان
چکیده
HiLog enhances the modeling capabilities of deductive databases and logic programming with higher-order and meta-data constructs, complex objects, and schema browsing. Its distinctive feature, a higher-order syntax with a rst-order semantics, allows for eecient implementation with speeds comparable to Prolog. In fact, HiLog implementation in XSB 30, 26] together with tabulated query evaluation ooers impressive performance with negligible penalty for higher-order syntax, thereby bringing the modeling capabilities of HiLog to practical realization. The lack of sorts in HiLog, however, is somewhat of a problem in database applications, which led to a number of HiLog dialects such as DataHiLog 24]. This paper develops a comprehensive theory of sorts for HiLog. It supports HiLog's exible higher-order syntax via a polymorphic and recursive sort structure, and it ooers an easy and convenient mechanism to control the rules of well-formedness. By varying the sort structure we obtain a full spectrum of languages, ranging from classical predicate logic to the original (non-sorted) HiLog. In between, there is a number of interesting higher-order extensions of Datalog with various degrees of control over the syntax, including second-order predicate calculus with Henkin-style semantics, as described in 10]. We also discuss the beneets of using Sorted HiLog for modeling complex objects and for meta programming. Finally, Sorted HiLog can be easily incorporated into XSB, which makes its practical realization feasible.
منابع مشابه
HILOG: A Foundation for Higher-Order Logic Programming
D We describe a novel logic, called HiLog, and show that it provides a more suitable basis for logic programming than does traditional predicate logic. HiLog has a higher-order syntax and allows arbitrary terms to appear in places where predicates, functions, and atomic formulas occur in predicate calculus. But its semantics is first-order and admits a sound and complete proof procedure. Applic...
متن کاملEfficient Execution of HiLog in WAM-based Prolog Implementations
In this paper we address the problem of eeciently implementing HiLog, a logic programming language with higher-order syntax and rst-order semantics. In contrast to approaches proposed in the literature that modify, or abandon the WAM framework in order to implement HiLog, our approach to the problem stems from a belief that the WAM should be an adequate abstract machine for the execution of any...
متن کاملOn the Relationship between Description Logic-based and F-Logic-based Ontologies
Many popular ontology languages are based on (subsets of) first-order predicate logic, with classes represented by unary predicates and properties by binary predicates. Specifically, the Semantic Web ontology language OWL DL is based on the Description Logic SHOIN . F-Logic is an ontology language which is also based on first-order logic, but classes and properties are modeled as terms rather t...
متن کاملSOUND AND COMPLETE TRANSLATIONSFROM SORTED HIGHER - ORDER LOGICINTO SORTED FIRST - ORDER LOGICManfred
Extending existing calculi by sorts is a strong means for improving the deductive power of rst-order theorem provers. Since many mathematical facts can be more easily expressed in higher-order logic { aside the greater power of higher-order logic in principle {, it is desirable to transfer the advantages of sorts in the rst-order case to the higher-order case. One possible method for automating...
متن کامل